Classifying Recursive Predicates and Languages
نویسندگان
چکیده
We study the classi cation of recursive predicates and languages. In particular, we compare the classi cation of predicates and languages with the classi cation of arbitrary recursive functions and with learning. Moreover, we re ne our investigations by introducing classi cation with a bounded number of mind changes and establish a new hierarchy. Furthermore, we introduce multi{classi cation and characterize it. Finally, we study the classi cation of families of languages that have attracted a lot of attention in learning theory.
منابع مشابه
Classifying Predicates and Languages
The present paper studies a particular collection of classi cation problems, i.e., the classi cation of recursive predicates and languages, for arriving at a deeper understanding of what classi cation really is. In particular, the classi cation of predicates and languages is compared with the classi cation of arbitrary recursive functions and with their learnability. The investigation undertake...
متن کاملClassi cation of Predicates and Languages
We study the classi cation of recursive predicates and languages. In particular, we compare the classi cation of predicates and languages with the classi cation of arbitrary recursive functions and with learning. Moreover, we re ne our investigations by introducing classi cation with a bounded number of mind changes and establish a new hierarchy. Furthermore, we introduce multi{classi cation an...
متن کاملImplementing Linguistic Query Languages Using LoToS
A linguistic database is a collection of texts where sentences and words are annotated with linguistic information, such as part of speech, morphology, and syntactic sentence structure. While early linguistic databases focused on word annotations, and later also on parse-trees of sentences (so-called treebanks), the recent years have seen a growing interest in richly annotated corpora of histor...
متن کاملPushing Predicates into Recursive SQL Common Table Expressions
A recursive SQL-1999 query consists of a recursive CTE (Common Table Expression) and a query which uses it. If such a recursive query is used in a context of a selection predicate, this predicate can possibly be pushed into the CTE thus limiting the breadth and/or depth of the recursive search. This can happen e.g. after the definition of a view containing recursive query has been expanded in p...
متن کاملConstructive Membership and Indexes in Trees
Trees carrying information stored in their nodes are a fundamental abstract data type. Approaching trees in a formal constructive environment allows us to realize properties of trees, inherent in their structure. Specifically we will look at the evidence provided by the predicates which operate on these trees. This evidence, expressed in terms of logical and programming languages, is realizable...
متن کامل